λ-calculus as a foundation of mathematics

نویسنده

  • Klaus Grue
چکیده

Church introduced λ-calculus in the beginning of the thirties as a foundation of mathematics and map theory from around 1992 fulfilled that primary aim. The present paper presents a new version of map theory whose axioms are simpler and better motivated than those of the original version from 1992. The paper focuses on the semantics of map theory and explains this semantics on basis of κ-Scott domains. The new version sheds some light on the difference between Russells and Burali-Fortis paradoxes, and also sheds some light on why it is consistent to allow non-well-founded sets in a ZF-style system. ∗DIKU, University of Copenhagen, Universitetsparken 1, DK-2100 Copenhagen, Denmark, E-mail [email protected]

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Dedekind completion as a method for constructing new Scott domains

Many operations exist for constructing Scott-domains. This paper presents Dedekind completion as a new operation for constructing such domains and outlines an application of the operation. Dedekind complete Scott domains are of particular interest when modeling versions of λ-calculus that allow quantification over sets of arbitrary cardinality. Hence, it is of interest when constructing models ...

متن کامل

Models of the Lambda Calculus: An Introduction

The λ -calculus is a symbolic formalism for describing and calculating with functions. To give meaning to expressions in the λ -calculus they must be interpreted in terms of standard mathematical objects such as sets and functions. Each such interpretation is called a model of the λ -calculus. Because the concept of function embodied in the λ -calculus is very general—for example, a λ -calculus...

متن کامل

A kappa-Denotational Semantics for Map Theory in ZFC + SI

Map theory, or MT for short, has been designed as an “integrated” foundation for mathematics, logic and computer science. By this we mean that most primitives and tools are designed from the beginning to bear the three intended meanings: logical, computational, and set-theoretic. MT was originally introduced in [18]. It is based on λ-calculus instead of logic and sets, and it fulfills Church’s ...

متن کامل

A Tutorial Introduction to the Lambda Calculus

This paper is a concise and painless introduction to the λ-calculus. This formalism was developed by Alonzo Church as a tool for studying the mathematical properties of effectively computable functions. The formalism became popular and has provided a strong theoretical foundation for the family of functional programming languages. This tutorial shows how to perform arithmetical and logical comp...

متن کامل

Intersection Typed λ - calculus

The aim of this paper is to discuss the design of an explicitly typed λ-calculus corresponding to the Intersection Type Assignment System (IT ), which assigns intersection types to the untyped λ-calculus. Two different proposals are given. The logical foundation of all of them is the Intersection Logic IL.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 1997